Exact Kanowledge Compilation in Predicate Calculus: The Partial Achievement Case
نویسندگان
چکیده
Forward chaining is an inference algorithm based on modus ponens which is widely used but unfortunately incomplete with respect to the usual boolean logic. A solution to this incompleteness is to compile the knowledge base so that forward chaining becomes complete for any base of facts. This compilation is called achievement and was so far restricted to propositional calculus. In this paper, we extend this compilation method to the predicate calculus. To our knowledge, this is the first exact knowledge compilation for first order logic.
منابع مشابه
An Early Use of Continuations and Partial Evaluation for Compiling Rules Written in Fopc
This brief historical note describes research which was done in the period 1970-1973, and where continuations were introduced in a fairly pragmatic way together with partial evaluation in order to compile \rules" expressed as statements in rst-order predicate calculus. The methods used at that time were quite straightforward , but they may be of some interest for the present workshop as an \ear...
متن کاملCross-Linguistic Transfer Revisited: The Case of English and Persian
The present study sought to investigate the evidence for cross-linguistic transfer in a partial English immersion and non-immersion educational setting. To this end, a total of 145 first, third and fifth graders in a partial English immersion program and 95 students from the same grade levels in a non-immersion program were chosen. Six different English and Persian tests were administered: the ...
متن کاملAcquiring Reliable Predicate-argument Structures from Raw Corpora for Case Frame Compilation
We present a method for acquiring reliable predicate-argument structures from raw corpora for automatic compilation of case frames. Such lexicon compilation requires highly reliable predicate-argument structures to practically contribute to Natural Language Processing (NLP) applications, such as paraphrasing, text entailment, and machine translation. We first apply chunking to raw corpora and t...
متن کاملA Practical Approach to Partiality - A Proof Based Approach
Partial functions are frequently used when specifying and reasoning about computer programs. Using partial functions entails reasoning about potentially ill-defined expressions. In this paper we show how to formally reason about partial functions without abandoning the well understood domain of classical two-valued predicate calculus. In order to achieve this, we extend standard predicate calcu...
متن کاملLogic Programming Optimizations for Faster Model Checking
Over the last three years, we have showed that logic programming with tabulation can be used to construct eÆcient model checkers [RRR97, CDD98, DDR99]. In particular, we have developed XMC [RRS00], a model checker which veri es properties written in the alternation-free fragment of the modal mu-calculus [Koz83] for systems speci ed in XL, an extension of value-passing CCS [Mil89]. The XMC syste...
متن کامل